Scalable fir filter

ABSTRACT

A Scalable Finite Impulse Response (“SFIR”) filter is disclosed. The SFIR filter includes a pre-processing section, a post-processing section, and a finite impulse response (“FIR”) Matrix. The FIR Matrix includes a plurality of filter taps and a plurality of signal paths in signal communication with each filter tap. The plurality of signal paths are arranged to allow re-configurable data throughput between the each filter tap and the pre-processing section and post-processing section are in signal communication with the FIR Matrix.

GOVERNMENT INTEREST

This invention was made with United States Government support. The government has certain rights in the invention.

BACKGROUND 1. Field

The present disclosure is related to filters, and more specifically, finite impulse response (“FIR”) filters.

2. Related Art

Digital filters are a key element in digital signal processing (“DSP”) applications, in particular any application that may transmit or receive a Radio Frequency (RF) signal. Moreover, Finite Impulse Response (“FIR”) Filters are a type of filter that is frequently used to perform matrix multiplication operations between input data and a set of coefficients. However, generally, the larger a filter becomes, the more difficult the filter becomes to manufacture when implemented in an Application Specific Integrated Circuit (“ASIC”) because of the number of required routes associated with the filter.

Generally, software (e.g., processors) or hardware (e.g., ASICs or Field Programmable Gate Arrays [“FPGAs”]) approaches are utilized for DSP applications. Hardware approaches are generally utilized for intensive DSP applications that require pipelining to achieve high data rates. However, a problem with both ASIC and FPGA devices is that a significant amount of the die area of both are consumed by filtering resources. This is because DSP applications typically involve a significant amount of filtering that may be estimated as needing approximately half the resources in a given application.

The problem with software approaches is that software solutions have difficulty with computational intensive DSP applications such as, for example, streaming data. Known hardware approaches are more suitable for these types of DSP applications but have varying problems with flexibility, efficiency, costs, size, weight, and power.

Specifically, the problem with ASICs is that they are integrated circuits that are fabricated from a predetermined design that is designed to perform a specific application. As such, they are efficient but traditionally inflexible because, again, they are designed and fabricated to perform very specific applications and do not have the flexibility to perform other functions or applications. Because of this limitation, they have high non-recurring engineering (“NRE”) costs in both the design and fabrication processes.

Unlike ASICs, FPGAs are flexible in operation because they may be programmed to perform different functions and applications. However, this flexible comes at a cost in high physical size and weight of the die and high power costs known as SWAP (size, weight, and power). As such, FPGAs are flexible but inherently inefficient.

Therefore, there is a need for a FIR filter design that is flexible, cost effective (i.e., has low NRE costs), and efficient (i.e., low SWAP).

SUMMARY

Disclosed is a Scalable Finite Impulse Response (“SFIR”) filter. The SFIR filter includes a pre-processing section, a post-processing section, and a finite impulse response (“FIR”) filtering matrix. The FIR Matrix includes a plurality of filter taps and a plurality of signal paths in signal communication with each filter tap. The plurality of signal paths are arranged to allow re-configurable data throughput between the each filter tap and the pre-processing module and post-processing module are in signal communication with the FIR Matrix.

Further disclosed is an Application Specific Integrated Circuit (“ASIC”). The ASIC includes the SFIR filter, where the SFIR filter includes the pre-processing section, the post-processing section, and the FIR Matrix. The FIR Matrix again includes the plurality of filter taps and the plurality of signal paths in signal communication with each filter tap, where the plurality of signal paths are arranged to allow re-configurable data throughput between the each filter tap. The pre-processing module and post-processing module are in signal communication with the FIR Matrix and the number of filter taps of the plurality of filter taps is predetermined.

Other devices, apparatus, systems, methods, features, and advantages of the disclosure will be or will become apparent to one with skill in the art upon examination of the following figures and detailed description. It is intended that all such additional systems, methods, features, and advantages be included within this description, be within the scope of the disclosure, and be protected by the accompanying claims.

BRIEF DESCRIPTION OF THE FIGURES

The disclosure may be better understood by referring to the following figures. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the disclosure. In the figures, like reference numerals designate corresponding parts throughout the different views.

FIG. 1 is a system diagram of an example of an implementation of a Scalable Finite Impulse Response (“SFIR”) filter in accordance with the present disclosure.

FIG. 2 is a system block diagram of an example of an implementation of a finite impulse response (“FIR”) Matrix, shown in FIG. 1, in accordance with the present disclosure.

FIG. 3 is a zoomed in view of the system block diagram, illustrated in FIG. 2, in accordance with the present disclosure.

FIG. 4A is a system block diagram of an example of an implementation of a data path through the FIR Matrix (shown in FIG. 2) in accordance with the present disclosure.

FIG. 4B is a system block diagram of an example of another implementation of four parallel data paths through the FIR Matrix (shown in FIGS. 2 and 4A) in accordance with the present disclosure.

FIG. 5 is a system block diagram of an example of an implementation of a filter tap in accordance with the present disclosure.

FIG. 6 is a system block diagram of an example of another implementation of a filter tap in accordance with the present disclosure.

FIG. 7 is a system block diagram of an example of an implementation of pipelining two filter taps in the SFIR filter in accordance with the present disclosure.

FIG. 8 is a system block diagram of an example of an implementation of FIR Matrix (shown in FIG. 2) with a plurality of input terminals, accumulator input, first output terminal, second output terminal, and accumulator output for each filter tap in accordance with the present disclosure.

FIG. 9 is a system block diagram of an example of an implementation of a real (i.e., non-complex) FIR filter in the SFIR filter in accordance with the present disclosure.

FIG. 10 is a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter in accordance with the present disclosure.

FIG. 11 is a system block diagram of an example of an implementation of a complex FIR filter in the SFIR filter in accordance with the present disclosure.

FIG. 12 is a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter in accordance with the present disclosure.

FIG. 13 is a system block diagram of an example of an implementation of a decimator in the SFIR filter in accordance with the present disclosure.

FIG. 14 is a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter in accordance with the present disclosure.

FIG. 15 is a system block diagram of an example of an implementation of an interpolator in the SFIR filter in accordance with the present disclosure.

FIG. 16 is a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter in accordance with the present disclosure.

DETAILED DESCRIPTION

A Scalable Finite Impulse Response (“SFIR”) filter is disclosed. The SFIR filter includes a pre-processing section, a post-processing section, and a finite impulse response (“FIR”) filtering matrix. The FIR Matrix includes a plurality of filter taps and a plurality of signal paths in signal communication with each filter tap. The plurality of signal paths are arranged to allow re-configurable data throughput between the each filter tap and the pre-processing module and post-processing module are in signal communication with the FIR Matrix.

Further disclosed is an Application Specific Integrated Circuit (“ASIC”). The ASIC includes the SFIR filter, where the SFIR filter includes the pre-processing section, the post-processing section, and the FIR Matrix. The FIR Matrix again includes the plurality of filter taps and the plurality of signal paths in signal communication with each filter tap, where the plurality of signal paths are arranged to allow re-configurable data throughput between the each filter tap. The pre-processing module and post-processing module are in signal communication with the FIR Matrix and the number of filter taps of the plurality of filter taps is predetermined.

Specifically, in FIG. 1, a system diagram is shown of an example of an implementation of a SFIR filter 100 in accordance with the present disclosure. In this example, the SFIR filter 100 is located within an ASIC 102. The SFIR filter 100 includes a pre-processing section 104, post-processing section 106, and FIR Matrix 108. The FIR Matrix 108 is in signal communication with both the pre-processing section 104 and post-processing section 106 via signal paths 110 and 112, respectively.

In an example, of operation, the SFIR filter 100 receives an input digital signal 114 at the pre-processing section 104 that processes and organizes the data in the input digital signal 114 in an arranged order that is passed to FIR Matrix 108 via input matrix signal 116 along the signal path 110. The FIR Matrix 108 receives and filters the input matrix signal 116 and to produce an intermediate filtered output signal 118 that is passed to the post-processing section 106 via the signal path 112. The post-processing section 106 receives the intermediate filtered output signal 118 and processes and organizes the data in the intermediate filtered output signal 118 to produce the filtered output signal 120 that is passed to other devices, components, circuitry, or modules in the ASIC 102. The SFIR filter 100 also includes a loopback signal path 122 that is from the post-processing section 106 to the pre-processing section 104.

In FIG. 2, a system block diagram is shown of an example of an implementation of a FIR Matrix 200 in accordance with the present disclosure. In this example, the FIR Matrix 200 includes a plurality of filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p and a plurality of signal paths 204, 206, 208, 210, and 212 in signal communication with each filter tap of the plurality of filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o, and 202 p. In this example, the plurality of signal paths 204, 206, 208, 210, and 212 are arranged and configured to allow re-configurable data throughput between the each filter tap.

For ease of illustration, in this example, only 16 filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p are shown arranged in a 4 by 4 (i.e., 4×4) matrix of filter taps. It is appreciated by those of ordinary skill in the art that the actual number of filter taps may be any number that is capable of physically fitting on the die size of the ASIC 102 based on the predetermined design of the ASIC 102. In general, the predetermined design includes at least four filter taps arranged as a two by two matrix of filter taps to a maximum number of taps arranged in an M by N matrix, where M 218 represents the number of rows of filter taps and N 220 represents the number of columns of filter taps in the matrix of filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p. The SFIR filter 100 may then be configured as a digital filter that has any arbitrary number of filter taps up to the maximum predetermined number of filter taps that is fabricated in the ASIC 102. This allows the SFIR filter 100 to be a scalable design on the ASIC 102 that is flexible similar to field programmable gate array (“FPGA”) but without the limitations of high size, weight, and power (“SWAP”) cost and inherent inefficiency associated with an FPGA.

As will be described later, by re-configuring the data throughput between the different filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p with the plurality of signal paths 204, 206, 208, 210, and 212, the FIR Matrix 200 may be configured to form FIR filters having different tap lengths and/or parallel FIR filters. For example, the FIR Matrix 200 may be configured to be a single serial FIR filter having up to 16 filter taps that are serially described as filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p. Alternatively, the FIR filter may be configured to be a parallel FIR filter having four parallel paths that include a first path through filter taps 202 a, 202 b, 202 c, and 202 d, a second path through filter taps 202 e, 202 f, 202 g, and 202 h, a third path through filter taps 202 i, 202 j, 202 k, and 202 l, and a fourth path through filter taps 202 m, 202 n, 202 o, and 202 p. It is appreciated that in a larger FIR Matrix 200 may more filter taps may be utilized either in a serial path or additional parallel paths based on the predetermined design and the available die space on the ASIC 102.

Also for ease of illustration, in this example, each filter tap is shown having a pair of input terminals 214 and pair of output terminals 216 in signal communication with the respective signal paths of the plurality of signal paths 204, 206, 208, 210, and 212. Specifically, in this example, the pair of input terminals 214 and pair of output terminals 216 are shown with regard to filter tap 202 a but it is appreciated that each filter tap of the remaining filter taps 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p also have a corresponding pair of input terminals and pair of output terminals.

When combined with the pre-processing section 104 and post-processing section 106, the FIR Matrix 200 allow the SFIR filter 100 to be configured as different types of digital filters such as, for example, a Hilbert transform filter, decimator, interpolator, real FIR filter (i.e., a real value filter that is not a complex filter), complex FIR filter, or adaptive filter. As an example, for real FIR filter (i.e., a non-complex FIR filter), the SFIR filter 100 may include the pre-processing section configured 104 as a first pass-through device and the post-processing section 106 configured as a second pass-through device. Alternatively, in a complex FIR filter, the SFIR filter 100 includes the pre-processing section 104 configured as a fan-out device and the post-processing section 106 configured as a summation device.

If, instead, the SFIR filter 100 is configured as a decimator, the SFIR filter 100 includes the pre-processing section 104 configured as a re-order device and the post-processing section 106 configured as a summation device. Moreover, if the SFIR filter 100 is configured as an interpolator, the interpolator includes the pre-processing section 104 configured as a fan-out device and the post-processing section 106 configured as a re-order device.

It is appreciated by those skilled in the art that the circuits, components, modules, and/or devices of, or associated with, the SFIR filter 100 and ASIC 102 are described as being in signal communication with each other, where signal communication refers to any type of communication and/or connection between the circuits, components, modules, and/or devices that allows a circuit, component, module, and/or device to pass and/or receive signals and/or information from another circuit, component, module, and/or device. The communication and/or connection may be along any signal path between the circuits, components, modules, and/or devices that allows signals and/or information to pass from one circuit, component, module, and/or device to another and includes wireless or wired signal paths. The signal paths may be physical, such as, for example, conductive wires, electromagnetic wave guides, cables, attached and/or electromagnetic or mechanically coupled terminals, semi-conductive or dielectric materials or devices, or other similar physical connections or couplings. Additionally, signal paths may be non-physical such as free-space (in the case of electromagnetic propagation) or information paths through digital components where communication information is passed from one circuit, component, module, and/or device to another in varying digital formats without passing through a direct electromagnetic connection.

Turning to FIG. 3, a zoomed in view of the system block diagram illustrated in FIG. 2 is shown in accordance with the present disclosure. In this example, only eight (8) filter taps 202 a, 202 b, 202 e, 202 f, 202 i, 202 j, 202 m, and 202 n of the 16 filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p are shown. Moreover, the pair of input terminals 214 have a plurality of input terminals 300 and an accumulator input 302 and the pair of output terminals 216 includes a first output terminal 304, second output terminal 306, and an accumulator output 308. Additionally, each of the filter taps 202 b, 202 f, 202 j, and 202 n also includes a plurality of input terminals 310, 312, 314, and 316 and an accumulator input 318, 320, 322, and 324, respectively, similar to the plurality of input terminals 300 and accumulator input 302 of the filter tap 202 a. Furthermore, each of the filter taps 202 e, 202 i, and 202 m include a first output terminal 326, 328, and 330, second output terminal 332, 334, and 336, and an accumulator output 338, 340, and 342, respectively, similar to the first output terminal 304, second output terminal 306, and accumulator output 308 of the filter tap 202 a.

In this example, the first output terminal 304 of the filter tap 202 a is in signal communication with a terminal of the plurality of input terminals 310 of the filter tap 202 b, a terminal of the plurality of input terminals 312 of the filter tap 202 f, and a terminal of the plurality of terminals 316 of the filter tap 202 n via signal paths 344, 346, and 348, respectively. The first output terminal 326 of the filter tap 202 e is in signal communication with a terminal of the plurality of input terminals 312 of the filter tap 202 f via signal path 350. Additionally, the first output terminal 328 of the filter tap 202 i is in signal communication with a terminal of the plurality of input terminals 314 of the filter tap 202 j, via signal path 352, and the first output terminal 330 of the filter tap 202 m is in signal communication with a terminal of the plurality of terminals 316 of the filter tap 202 n via signal path 354. In this example, the signal paths 344, 350, 352, 354, 362, 364, 366, and 368 are serial signal paths and signal paths 346, 348, 356, 358, and 360 are cross signal paths. Moreover, the serial signal paths 362, 364, 366, and 368 are adder signal paths and the cross signal paths 356, 358, and 360 are pipeline data signal paths.

The second output terminal 332 of the filter tap 202 e is in signal communication with another terminal of the plurality of input terminals 310 of the filter tap 202 b via signal path 356. As will be discussed later, in this example, a first pipeline data signal path 356 from a first filter first flip-flop (not shown but located within filter tap 202 e) to the second filter tap second flip-flop (not shown but located within filter tap 202 b) through a first filter gain section multiplier (not shown) and a first filter adder (not shown). Additionally, the second output terminal 334 of the filter tap 202 i is in signal communication with another terminal of the plurality of input terminals 312 of the filter tap 202 f via signal path 358. Moreover, the second output terminal 336 of the filter tap 202 m is in signal communication with another terminal of the plurality of input terminals 314 of the filter tap 202 j via signal path 360.

The accumulator output 308 of the filter tap 202 a is in signal communication with accumulator input 318 of the filter tap 202 b via signal path 362 and the accumulator output 338 of the filter tap 202 e is in signal communication with accumulator input 320 of the filter tap 202 f via signal path 364. Moreover, the accumulator output 340 of the filter tap 202 i is in signal communication with accumulator input 322 of the filter tap 202 j via signal path 366 and the accumulator output 342 of the filter tap 202 m is in signal communication with accumulator input 324 of the filter tap 202 n via signal path 368. In this example, the signal paths 344, 346, 348, 350, 352, 354, 356, 358, and 360 are part of the plurality of signal paths 206 shown in FIG. 2.

In general and as will be discussed later, in this example, each filter tap 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p includes a multiplexer, a first delay element in signal communication with an output of the multiplier, a gain section, a second delay element, and an adder in signal communication with both the multiplier and second flip-flop. The first and second delay elements may each be a flip-flop, such as, for example, a J-K or D flip-flop. Based on this, the plurality of input terminals 300, 310, 312, 314, and 316 are the plurality of inputs to the respective multiplexers of each of the filter taps 202 a, 202 b, 202 f, 202 j, and 202 n, respectively. The first output terminal 304, 326, 328, and 330 may be a pass though signal path from the output of the multiplexers (i.e., filter tap multiplexers) in the respective filter taps 202 a, 202 e, 202 i, and 202 m. Moreover, the second output terminal 306, 332, 334, and 336 may be the output from the first delay element in the respective filter taps 202 a, 202 e, 202 i, and 202 m and the accumulation output 308, 338, 340, and 342 may be output from the adders in the respective filter taps 202 a, 202 e, 202 i, and 202 m. Furthermore, the accumulator input 302, 318, 320, 322, and 324 may be accumulation input to the respective filter taps 202 a, 202 b, 202 f, 202 j, and 202 n.

It is appreciated by those of ordinary skill in the art that parallel digital filters are usually utilized to process even number of parallel paths. As such, in this example, the plurality of signal paths 206 are show communicating with an even number of paths such as filter tap 202 a being in signal communication with 202 b, 202 f, and 202 n via signal paths 344, 346, and 348 but not in signal communication with filter tap 202 j. However, it is appreciated that filter tap 202 a may be optionally in signal communication with the plurality of input terminals 314 for non-even applications without departing from the scope of the disclosure.

In this example, the first output terminals 304, 326, 328, and 330 and second output terminals 306, 332, 334, and 336 produce the same signal with the difference that the second output terminals 306, 332, 334, and 336 produce that same signal delayed in time versus the signal produced at the first output terminals 304, 326, 328, and 330. In other words, the signals produced at the first output terminals 304, 326, 328, and 330 may be represented as x_(n)(t) while the signals produced at the second output terminals 306, 332, 334, and 336 may be represented as x_(n)(t+1), where x represent the signal, n represents the parallel path, and t represent time. In general, in this example, there is no need to connect the delayed signal in the top row (i.e., second output terminal 306 of filter tap 202 a) to other filter taps (e.g., filter tap 202 b and others that are not shown) for applications that include serial or parallel data. Moreover, for all the other rows (i.e., the rows that include filter taps 202 e and 202 f, filter taps 202 i and 202 j, and filter taps 202 m and 202 n, respectively), when incoming data is introduced in parallel, the signals that are passed to the other filter taps needs to be delayed for some connections so that the data is aligned properly as it goes through the FIR Matrix 200. As such, in this example, undelayed signal produced by the first output terminals 304, 326, 328, and 330 are utilized in the first row (i.e., from filter taps 202 a and 202 b) and delayed signals produced by the second output terminals 306, 332, 334, and 336 are utilized in the other rows (i.e., the rows that include filter taps 202 e and 202 f, filter taps 202 i and 202 j, and filter taps 202 m and 202 n, respectively).

In FIG. 4A, a system block diagram of an example of an implementation of a data path 400 is shown through the FIR Matrix 200 (shown in FIG. 2) in accordance with the present disclosure. In this example, the plurality of signal paths 204, 206, 208, 210, and 212 are configured such that the FIR Matrix 200 is configured as a digital filter having 16 filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p with one serial data stream of data along the data path 400. In this example, the data path 400 may be referred to a “thin pipe” of data through the SFIR filter 100. In this example, the FIR Matrix 200 has 16 filter taps that may be optionally configured from a simple one serial input four tap filter or a two parallel input two tap filter up to a serial input 16 tap filter or four parallel input four tap filter.

In FIG. 4B, a system block diagram of an example of another implementation of four parallel data paths 402, 404, 406, and 408 are shown through the FIR Matrix 200 (shown in FIGS. 2 and 4A) in accordance with the present disclosure. In this example, the plurality of signal paths 204, 206, 208, 210, and 212 are configured such that the FIR Matrix 200 is configured as a digital filter having 4 filter taps along the four parallel data paths 402, 404, 406, and 408. In this example, the first parallel data path 402 is along tap filters 202 a, 202 b, 202 c, and 202 d and the second parallel data path 404 is along tap filters 202 e, 202 f, 202 g, and 202 h. The third parallel data path 406 is along tap filters 202 i, 202 j, 202 k, and 202 l and the fourth parallel data path 408 is along tap filters 202 m, 202 n, 202 o and 202 p. In this example, the first, second, third, and fourth data paths 402, 404, 406, and 408 may be referred to as a number of independent “thin pipes” of data, or a single “fat pipe” of data through the SFIR filter 100, depending on the configuration of SFIR filter 100.

Utilizing the design of the SFIR filter 100 on an ASIC 102, the SFIR filter 100 may be fabricated with an arbitrary filter length (i.e., an arbitrary number of filter taps) or real-time data throughput (i.e., the number of parallel inputs and outputs). Once fabricated, the same filter structure may be re-configured to handle differ data inputs such that, for example, the SFIR filter 100 may be re-configured to filter a small number of fat pipes or a large number of thin pipes. Likewise, the same filter structure may be re-configured to perform different filter operations such that, for example, the SFIR filter 100 may be reconfigured to provide a high number of filter taps for a low aggregate data rate, or a low number of filter taps for a high aggregate data rate. In general, interconnects formed by the plurality of signal paths 204, 206, 208, 210, and 212 between the multiplexers (in the filter taps) allow the SFIR filter 100 to be re-configured.

Turning to FIG. 5, a system block diagram of an example of an implementation of a filter tap 500 is shown in accordance with the present disclosure. The filter tap 500 includes a multiplexer 502, a first delay element 504, a gain section 506, a second delay element 508, and an adder 510 (also known as a filter adder). In this example, the gain section 506 includes a gain section multiplier 512 (also referred to as a filter gain section multiplier) and a coefficient section 514. In this example, the first delay element 504 and second delay element 508 may be implemented utilizing flip-flops such as, for example, D, J-K, or R-S type flip-flops.

In these examples, the filter coefficients are preferably configurable by a user instead of being hard coded. They may be implemented, for example, utilizing registers and/or flip-flops that may be configurable by loading the registers and/or flip-flops utilizing a Network-on-Chip communication subsystem or other type of system.

In this example, the multiplexer 502 is in signal communication with the first delay element 504 via signal path 516. The gain section multiplier 512 is in signal communication with the first delay element 504, coefficient section 514, and adder 510 via signal paths 518, 520, and 522, respectively. Furthermore, the multiplexer 502 is in signal communication with the plurality of input terminals 524, the second delay element 508 is in signal communication with the accumulation input 526, the output of the multiplexer 502 is in signal communication with the first output terminal 528, the output of the first delay element 504 is in signal communication with the second output terminal 530, and the adder 510 is in signal communication with accumulator output 532.

In this example, the plurality of input terminals 524 (referred to as “mux-in”), first output terminal 528 (referred to as “mux-out”), and second output terminal 530 (referred to as “mux-out-dly”) are the input to and the undelayed output of the multiplexer 502, respectively. Turning back to FIG. 2 with reference to FIG. 5, the plurality of filter taps 202 a, 202 b, 202 c, 202 d, 202 e, 202 f, 202 g, 202 h, 202 i, 202 j, 202 k, 202 l, 202 m, 202 n, 202 o and 202 p are shown as an M by N matrix, where M 218 represents the number of rows of filter taps and N 220 represents the number of columns of filter taps in the M by N matrix. In this example, the first filter tap 202 a is assumed to be at a location 0, 0 (i.e., M and N both equal 0) within the M by N matrix.

Assuming that a number P represents the number of parallel path configurations in the filter tap 500, the total number of inputs to any multiplexer (e.g., the mux-in plurality of input terminals 524 to multiplexer 502) will be determined by P, where P is a non-zero positive integer equal to 1 or greater. If [(M+1)mod P]=0, then mux_in (M, N)=mux_out (M−P+1, N−1), else mux_in (M, N)=mux_out (M+1, N−1).

It is appreciated by those of ordinary skill in the art that the examples described in this disclosure are examples that utilize an even number (i.e., 2^(n)) of taps and parallel paths. This has been done for simplicity of illustration but it is appreciated that the examples given will also be applicable to non-even number of taps and parallel paths since the FIR design described will be applicable to any height and width combination.

In FIG. 6, a system block diagram of an example of another implementation of a filter tap 600 is shown in accordance with the present disclosure. As in the filter tap 500 shown in FIG. 5, the filter tap 600 includes a multiplexer 602, a first delay element 604, a gain section 606, a second delay element 608, and an adder 610. Similarly, in this example, the gain section 606 includes a gain section multiplier 612 and a coefficient section 614.

As discussed before, the multiplexer 602 is in signal communication with the first delay element 604 via signal path 516. The gain section multiplier 612 is in signal communication with the first delay element 604, coefficient section 614, and adder 610 via signal paths 618, 620, and 622, respectively. Furthermore, the multiplexer 602 is in signal communication with the plurality of input terminals 624, the second delay element 608 is in signal communication with the accumulation input 626, the output of the multiplexer 602 is in signal communication with the first output terminal 628, the output of the first delay element 604 is in signal communication with the second output terminal 630, and the adder 610 is in signal communication with accumulator output 632.

However, in this example, the first delay element 604, the second delay element 608, and coefficient section 614 are D-type flip-flops that act as data latches, where they hold or remember the data present on their data input (the “D” input shown). D-type flip-flops generally act as one-bit data latches that pass their data input based on their clock inputs. In the present disclosure, the D-type flip-flops are generally implemented as multi-bit registers. It is appreciated by those of ordinary skill in the art other types of flip-flops (such as, for example, J-K or R-S flip-flops) may also be utilized with the appropriate circuitry to support data latching.

The utilization of D-type flip-flops for the first delay element 604, the second delay element 608, and coefficient section 614 within each filter tap (i.e., every stage) of the SFIR filter 100 allow the design of the SFIR filter 100 to be scaled up to any size FIR filter desired. Additionally, the D-type flip-flops reduce routing congestion between filter taps and do not slow down the clock speeds of various configured filters within the SFIR filter 100. The D-type flip-flops for first delay element 604 and the second delay element 608 add pipelining to the ASIC 102 that allows the SFIR filter 100 to operate much quicker than known FIR techniques utilizing multiple filter taps. Specifically, the D-type flip-flops for first delay element 604 and the second delay element 608 pipelines the accumulator path (i.e., from the first delay element 604 through the gain section multiplier 612 to the adder 610) so that the maximum logic states crosses between registered elements (i.e., filter taps) is always just one multiplier and one adder. This maintains the maximum data throughput for any configured filter length. Furthermore, in a parallel filter design of the SFIR filter 100, each registered data input goes to only one multiplier regardless of filter size or configuration without having to fan-out to different multipliers as in traditional filter designs. The SFIR filter 100, as disclosed, includes built-in pipelining such that the input and output of each filter tap is in signal communication to each multiplier. This point-to-point approach allows the SFIR filter 100 to route and maintain a high achievable clock speed even as the SFIR filter 100 grows in size.

In this example, for ease of illustration and simplicity, the flip-flop implementation is shown as one-bit data latches; however, it is appreciated by those of ordinary skill in the art that in practice the flip-flops will likely be implemented as multi-bit data latches. Moreover, in practice the adder 610 may be implemented by a plurality of adders and the gain section multiplier 612 may be implemented as a plurality of gain section multipliers.

In this example, the data width of the first delay element 604 and coefficient section 614 are user defined and the data width of the second delay element 608 is driven by the bit growth through the plurality of gain section multipliers (that includes gain section multiplier 612) and the plurality of adders (that includes adder 610). Typically, the input data path through the plurality of input terminals 624, multiplexer 602, signal path 516 and first delay element 604 will be driven by a signal source such as, for example, an analog-to-digital converter (“ADC”). The coefficient section 614 will be driven by the needed filter performance, which usually needs more bits for higher performance of the filter. The accumulation path through the second delay element 608 has a data width that is equal to the data width of the first delay element 604 plus the data width of the coefficient section 614 and the base 2 logarithm (“log 2”) of the number of filter taps. As an example, if the SFIR filter 100 has an 8 bit data input, 16 bit coefficients, and 16 filter taps, the data width of second delay element 608 will be equal to 8 plus 16 plus 4 that equals 28.

In FIG. 7, a system block diagram of an example of an implementation of pipelining two filter taps 600 and 700 in the SFIR filter 100 is shown in accordance with the present disclosure. In this example, the filter tap 600 (shown and described in relation to FIG. 6) is shown as a first tap filter in signal communication with a second filter tap 700. Similar to the first filter tap 600, the second filter tap 700 includes a multiplexer 702, a first delay element 704, a gain section 706, a second delay element 708, and an adder 710. Similarly, in this example, the gain section 706 includes a gain section multiplier 712 and a coefficient section 714.

As discussed before, the multiplexer 702 is in signal communication with the first delay element 704 via signal path 716. The gain section multiplier 712 is in signal communication with the first delay element 704, coefficient section 714, and adder 710 via signal paths 718, 720, and 722, respectively. Furthermore, the multiplexer 702 is in signal communication with the plurality of input terminals 724, the second delay element 708 is in signal communication with the accumulation input 726, the output of the multiplexer 702 is in signal communication with the first output terminal 728, the output of the first delay element 704 is in signal communication with the second output terminal 730, and the adder 710 is in signal communication with accumulator output 732. Similar to the example in relation to FIG. 6, in this example, the first delay element 704, the second delay element 708, and coefficient section 714 are D-type flip-flops that act as data latches, where they hold or remember the data present on their data input.

In this example, the first output terminal 628 of the first filter tap 600 is in signal communication with multiplexer 702 of the second filter tap 700 via a signal path 734 and one of the terminals of the plurality of input terminals 724. Additionally, the accumulator output 632 of the first filter tap 600 is in signal communication with the second delay element 708 of the second filter tap 700 through the signal path 736 and the accumulator input 726. In other words, the signal path 736 is a first adder signal path from the adder 610 (i.e., a first filter tap adder) to the second delay element 708 (i.e., the second filter tap second flip-flop).

In an example of operation, the D-type flip-flop of the first delay element 604 of the first tap 600 produces a data value 738 at the Q-output that is multiplied, at the gain section multiplier 612, with a coefficient value 740 to produce filter output value 742 that is combined in the adder 610 with any previous accumulation value 744 to produce an accumulation value 746 that is passed to the input 748 of the D-input of the D-type flip-flop of the second delay element 708 of the second filter tap 700 via the accumulator input 726. The process would repeat to any other filter taps that are in signal communication with accumulator output 732 of the second filter tap 700.

Turning to FIG. 8, a system block diagram is shown of an example of an implementation of FIR Matrix 800 (shown in FIG. 2) with a plurality of input terminals 802 a, 802 b, 802 c, 802 d, 802 e, 802 f, 802 g, 802 h, 802 i, 802 j, 802 k, 802 l, 802 m, 802 n, 802 o, and 802 p, accumulator input 804 a, 804 b, 804 c, 804 d, 804 e, 804 f, 804 g, 804 h, 804 i, 804 j, 804 k, 804 l, 804 m, 804 n, 804 o, and 804 p, first output terminal 806 a, 806 b, 806 c, 806 d, 806 e, 806 f, 806 g, 806 h, 806 i, 806 j, 806 k, 8061, 806 m, 806 n, 806 o, and 806 p, second output terminal 808 a, 808 b, 808 c, 808 d, 808 e, 808 f, 808 g, 808 h, 808 i, 808 j, 808 k, 808 l, 808 m, 808 n, 808 o, and 808 p, and accumulator output 810 a, 810 b, 810 c, 810 d, 810 e, 810 f, 810 g, 810 h, 810 i, 810 j, 810 k, 810 l, 810 m, 810 n, 810 o, and 810 p for each filter tap 812 a, 812 b, 812 c, 812 d, 812 e, 812 f, 812 g, 812 h, 812 i, 812 j, 812 k, 812 l, 812 m, 812 n, 812 o, and 812 p in accordance with the present disclosure. In this example, it is assumed that every filter tap 812 a, 812 b, 812 c, 812 d, 812 e, 812 f, 812 g, 812 h, 812 i, 812 j, 812 k, 812 l, 812 m, 812 n, 812 o, and 812 p includes a first delay element 604 flip-flop, gain section 606, and second delay element 608 flip-flop as shown and described in relation to FIG. 6. Similar to the examples shown in relation to FIGS. 2, 4A, and 4B, the filter taps are in signal communication with each other via the plurality of signal paths 814, 816, and 818, respectively.

In this example, the following tables (Tables 1 through 6) of filter element values for FIR Matrix 800 performing four parallel processing paths are described for five clock cycles (i.e., clock cycles 0 through 5). Additionally, in this example, the following signal path connections are assumed.

The first output terminal 806 a (for example, the first output terminal 528 shown in FIG. 5) of filter tap 812 a is in signal communication with an input terminal of the plurality of input terminals 802 b (for example, the plurality of input terminals 524 shown in FIG. 5) at filter tap 812 b, an input terminal of the plurality of input terminals 802 f at filter tap 812 f, and an input terminal of the plurality of input terminals 802 n at filter tap 812 n. The first output terminal 806 b of filter tap 812 b is in signal communication with an input terminal of the plurality of input terminals 802 c at filter tap 812 c, an input terminal of the plurality of input terminals 802 g at filter tap 812 g, and an input terminal of the plurality of input terminals 802 o at filter tap 812 o. The first output terminal 806 c of filter tap 812 c is in signal communication with an input terminal of the plurality of input terminals 802 d at filter tap 812 d, an input terminal of the plurality of input terminals 802 h at filter tap 812 h, and an input terminal of the plurality of input terminals 802 p at filter tap 812 p. The accumulator output 810 a (for example, the accumulator output 532 shown in FIG. 5) of filter tap 812 a is in signal communication an accumulator input 804 b (for example, accumulator input 526 shown in FIG. 5) at filter tap 812 b. Additionally, the accumulator output 810 b of filter tap 812 b is in signal communication an accumulator input 804 c at filter tap 812 c and the accumulator output 810 c of filter tap 812 c is in signal communication an accumulator input 804 d at filter tap 812 d.

The first output terminal 806 e of filter tap 812 e is in signal communication with an input terminal of the plurality of input terminals 802 f at filter tap 812 f. The second output terminal 808 e (for example, second output terminal 530 shown in FIG. 5) of filter tap 812 e is in signal communication with another input terminal of the plurality of input terminals 802 b at filter tap 812 b. The first output terminal 806 f of filter tap 812 f is in signal communication with an input terminal of the plurality of input terminals 802 g at filter tap 812 g. The second output terminal 808 f of filter tap 812 f is in signal communication with another input terminal of the plurality of input terminals 802 c at filter tap 812 c. The first output terminal 806 g of filter tap 812 g is in signal communication with an input terminal of the plurality of input terminals 802 h at filter tap 812 h. The second output terminal 808 g of filter tap 812 g is in signal communication with another input terminal of the plurality of input terminals 802 d at filter tap 812 d. The accumulator output 810 e of filter tap 812 e is in signal communication an accumulator input 804 f at filter tap 812 f. Additionally, the accumulator output 810 f of filter tap 812 f is in signal communication an accumulator input 804 g at filter tap 812 g and the accumulator output 810 g of filter tap 812 g is in signal communication an accumulator input 804 h at filter tap 812 h.

The first output terminal 806 i of filter tap 812 i is in signal communication with an input terminal of the plurality of input terminals 802 j at filter tap 812 j. The second output terminal 808 i of filter tap 812 i is in signal communication with another input terminal of the plurality of input terminals 802 f at filter tap 812 f. The first output terminal 806 j of filter tap 812 j is in signal communication with an input terminal of the plurality of input terminals 802 k at filter tap 812 k. The second output terminal 808 j of filter tap 812 j is in signal communication with another input terminal of the plurality of input terminals 802 g at filter tap 812 g. The first output terminal 806 k of filter tap 812 k is in signal communication with an input terminal of the plurality of input terminals 802 l at filter tap 812 l. The second output terminal 808 k of filter tap 812 k is in signal communication with another input terminal of the plurality of input terminals 802 h at filter tap 812 h. The accumulator output 810 i of filter tap 812 i is in signal communication an accumulator input 804 j at filter tap 812 j. Additionally, the accumulator output 810 j of filter tap 812 j is in signal communication an accumulator input 804 k at filter tap 812 k and the accumulator output 810 k of filter tap 812 k is in signal communication an accumulator input 804 l at filter tap 812 l.

The first output terminal 806 m of filter tap 812 m is in signal communication with an input terminal of the plurality of input terminals 802 n at filter tap 812 n. The second output terminal 808 m of filter tap 812 m is in signal communication with another input terminal of the plurality of input terminals 802 j at filter tap 812 j. The first output terminal 806 n of filter tap 812 n is in signal communication with an input terminal of the plurality of input terminals 802 o at filter tap 812 o. The second output terminal 808 n of filter tap 812 n is in signal communication with another input terminal of the plurality of input terminals 802 k at filter tap 812 k. The first output terminal 806 o of filter tap 812 o is in signal communication with an input terminal of the plurality of input terminals 802 p at filter tap 812 p. The second output terminal 808 o of filter tap 812 o is in signal communication with another input terminal of the plurality of input terminals 802 l at filter tap 812 l. The accumulator output 810 m of filter tap 812 m is in signal communication an accumulator input 804 n at filter tap 812 n. Additionally, the accumulator output 810 n of filter tap 812 n is in signal communication an accumulator input 804 o at filter tap 812 o and the accumulator output 810 o of filter tap 812 o is in signal communication an accumulator input 804 p at filter tap 812 p.

In this example, the x value outputs (i.e., x_(out)) of the last filter tap (i.e., filter taps 812 d, 812 h, 812 l, and 812 p) of the parallel paths through the FIR Matrix 800 are shown as first x_(out) 820, second x_(out) 822, third x_(out) 824, and fourth x_(out) 826. These values correspond to the values stored within the first delay elements (e.g., flip-flops) in the respective last filter tap. Similarly, the y value outputs (i.e., y_(out)) of the last filter tap of the parallel paths through the FIR Matrix 800 are shown as first y_(out) 828, second y_(out) 830, third y_(out) 832, and fourth y_(out) 834. These values correspond to the values produced by the adder within (e.g., adder 510 in FIG. 5) the respective last filter tap.

It is appreciated by those of ordinary skill in the art that the general relationship for a FIR filter is described as follows:

${y_{n} = {\sum\limits_{i = 0}^{N}{c_{i}*x_{n - i}}}},$

where the value x_(n) is the input values to the FIR filter, N is the filter order (i.e., designates the total number of filter taps), c_(i) is the impulse response at i^(th) instant for 0≤i≤N of the N^(th) order FIR filter that corresponds to the FIR filter coefficient values, and y_(n) is the output value of the FIR filter. In this example, values x₀ through x₁₉ are the FIR Matrix 800 filter input values, the values x_(i) represent the sequential samples in time of the same data stream where, in this example, the data throughput of the FIR filter is four samples per clock, and the values c₀ through c₃ are the filter coefficient values. For simplicity, only values x₀ through x₁₉ are called out in the tables below. As described earlier, the variable x_(out) is the value of the first delay element in the last filter tap in the parallel paths (i.e., filter taps 812 d, 812 h, 812 l, and 812 p, respectively). The variable y_(out) is the accumulation output values of the parallel paths at the last filter tap (i.e., filter taps 812 d, 812 h, 812 l, and 812 p) in respective the parallel path.

TABLE 1 for Clock Cycle 0 Element\Filter Tap Tap 812a Tap 812b Tap 812c Tap 812d Input to filter tap x₀ Output of Multiplexer x₀ 1^(st) delay element 2^(nd) delay element before adder Element\Filter Tap Tap 812e Tap 812f Tap 812g Tap 812h Input to filter tap x₁ Output of Multiplexer x₁ 1^(st) delay element 2^(nd) delay element before adder Element\Filter Tap Tap 812i Tap 812j Tap 812k Tap 812l Input to filter tap x₂ Output of Multiplexer x₂ 1^(st) delay element 2^(nd) delay element before adder Element\Filter Tap Tap 812m Tap 812n Tap 812o Tap 812p Input to filter tap x₃ x₀ Output of Multiplexer x₃ x₀ 1^(st) delay element 2^(nd) delay element before adder

TABLE 2 for Clock Cycle 1 Element\Filter Tap Tap 812a Tap 812b Tap 812c Tap 812d Input to filter tap x₄ x₄, x₁ x₁ Output of Multiplexer x₄ x₁ 1^(st) delay element x₀ 2^(nd) delay element before adder Element\Filter Tap Tap 812e Tap 812f Tap 812g Tap 812h Input to filter tap x₅ x₄, x₅, x₂ x₁, x₂ Output of Multiplexer x₅ x₂ 1^(st) delay element x₁ 2^(nd) delay element before adder Element\Filter Tap Tap 812i Tap 812j Tap 812k Tap 812l Input to filter tap x₆ x₆, x₃ x₃, x₀ Output of Multiplexer x₆ x₃ 1^(st) delay element x₂ 2^(nd) delay element before adder Element\Filter Tap Tap 812m Tap 812n Tap 812o Tap 812p Input to filter tap x₇ x₄, x₆, x₇ x₁, x₃, x₄ Output of Multiplexer x₇ x₄ x₁ 1^(st) delay element x₃ x₀ 2^(nd) delay element before adder

TABLE 3 for Clock Cycle 2 Element\Filter Tap Tap 812a Tap 812b Tap 812c Tap 812d Input to filter tap x₈ x₈, x₅ x₅, x₂ Output of Multiplexer x₈ x₅ x₂ 1^(st) delay element x₄ x₁ 2^(nd) delay element before x₀*c₀ adder Element\Filter Tap Tap 812e Tap 812f Tap 812g Tap 812h Input to filter tap x₉ x₈, x₉, x₆ x₅, x₆, x₃ x₂, x₃, x₀ Output of Multiplexer x₉ x₆ x₃ x₀ 1^(st) delay element x₅ x₂ 2^(nd) delay element before x₁*c₀ adder Element\Filter Tap Tap 812i Tap 812j Tap 812k Tap 812l Input to filter tap x₁₀ x₁₀, x₇ x₇, x₄ x₄, x₁ Output of Multiplexer x₁₀ x₇ x₄ x₁ 1^(st) delay element x₆ x₃ x₀ 2^(nd) delay element before x₂*c₀ adder Element\Filter Tap Tap 812m Tap 812n Tap 812o Tap 812p Input to filter tap x₁₁ x₈, x₁₀, x₁₁ x₅, x₇, x₈ x₂, x₄, x₅ Output of Multiplexer x₁₁ x₈ x₅ x₂ 1^(st) delay element x₇ x₄ x₁ 2^(nd) delay element before x₃*c₀ adder

TABLE 4 for Clock Cycle 3 Element\Filter Tap Tap 812a Tap 812b Tap 812c Tap 812d Input to filter tap x₁₂ x₁₂, x₉ x₉, x₆ x₆, x₃ Output of Multiplexer x₁₂ x₉ x₆ x₃ 1^(st) delay element x₈ x₅ x₂ 2^(nd) delay element before x₄*c₀ x₀*c₀ + adder x₁*c₁ Element\Filter Tap Tap 812e Tap 812f Tap 812g Tap 812h Input to filter tap x₁₃ x₁₂, x₁₃, x₉, x₁₀, x₆, x₇, x₁₀ x₇ x₄ Output of Multiplexer x₁₃ x₁₀ x₇ x₄ 1^(st) delay element x₉ x₆ x₃ x₀ 2^(nd) delay element before x₅*c₀ x₁*c₀ + adder x₂*c₁ Element\Filter Tap Tap 812i Tap 812j Tap 812k Tap 812l Input to filter tap x₁₄ x₁₄, x₁₁ x₁₁, x₈ x₈, x₅ Output of Multiplexer x₁₄ x₁₁ x₈ x₅ 1^(st) delay element x₁₀ x₇ x₄ x₁ 2^(nd) delay element before x₆*c₀ x₂*c₀ + adder x₃*c₁ Element\Filter Tap Tap 812m Tap 812n Tap 812o Tap 812p Input to filter tap x₁₅ x₁₂, x₁₄, x₉, x₁₁, x₆, x₈, x₁₅ x₁₂ x₉ Output of Multiplexer x₁₅ x₁₂ x₉ x₆ 1^(st) delay element x₁₁ x₈ x₅ x₂ 2^(nd) delay element before x₇*c₀ x₃*c₀ + adder x₄*c₁

TABLE 5 for Clock Cycle 4 Element\Filter Tap Tap 812a Tap 812b Tap 812c Tap 812d Input to filter tap x₁₆ x₁₆, x₁₃ x₁₃, x₁₀ x₁₀, x₇ Output of Multiplexer x₁₆ x₁₃ x₁₀ x₇ 1^(st) delay element x₁₂ x₉ x₆ x₃ 2^(nd) delay element before x₈*c₀ x₄*c₀ + x₀*c₀ + adder x₅*c₁ x₁*c₁ + x₂*c₂ Element\Filter Tap Tap 812e Tap 812f Tap 812g Tap 812h Input to filter tap x₁₇ x₁₆, x₁₇, x₁₃, x₁₄, x₁₀, x₁₁, x₁₄ x₁₁ x₈ Output of Multiplexer x₁₇ x₁₄ x₁₁ x₈ 1^(st) delay element x₁₃ x₁₀ x₇ x₄ 2^(nd) delay element before x₉*c₀ x₅*c₀ + x₁*c₀ + adder x₆*c₁ x₂*c₁ + x₃*c₂ Element\Filter Tap Tap 812i Tap 812j Tap 812k Tap 812l Input to filter tap x₁₈ x₁₈, x₁₅ x₁₅, x₁₂ x₁₂, x₉ Output of Multiplexer x₁₈ x₁₅ x₁₂ x₉ 1^(st) delay element x₁₄ x₁₁ x₈ x₅ 2^(nd) delay element before x₁₀*c₀ x₆*c₀ + x₂*c₀ + adder x₇*c₁ x₃*c₁ + x₄*c₂ Element\Filter Tap Tap 812m Tap 812n Tap 812o Tap 812p Input to filter tap x₁₉ x₁₆, x₁₈, x₁₃, x₁₅, x₁₀, x₁₂, x₁₉ x₁₆ x₁₃ Output of Multiplexer x₁₉ x₁₆ x₁₃ x₁₀ 1^(st) delay element x₁₅ x₁₂ x₉ x₆ 2^(nd) delay element before x₁₁*c₀ x₇*c₀ + x₃*c₀ + adder x₈*c₁ x₄*c₁ + x₅*c₂

TABLE 6 for Clock Cycle 5 Element\Filter Tap Tap 812a Tap 812b Tap 812c Tap 812d Input to filter tap x₁₇ x₁₇, x₁₄ x₁₄, x₁₁ Output of Multiplexer x₁₇ x₁₄ x₁₁ 1^(st) delay element x₁₆ x₁₃ x₁₀ x₇ 2^(nd) delay element before x₁₂*c₀ x₈*c₀ + x₄*c₀ + adder x₉*c₁ x₅*c₁ + x₆*c₂ First x_(out) 820 x₃ First y_(out) 828 x₀*c₀ + x₁*c₁ + x₂*c₂ + x₃*c₃ + Element\Filter Tap Tap 812e Tap 812f Tap 812g Tap 812h Input to filter tap x₁₈ x₁₇, x₁₈, x₁₄, x₁₅, x₁₅ x₁₂ Output of Multiplexer x₁₈ x₁₅ x₁₂ 1^(st) delay element x₁₇ x₁₄ x₁₁ x₈ 2^(nd) delay element before x₁₃*c₀ x₉*c₀ + x₅*c₀ + adder x₁₀*c₁ x₆*c₁ + x₇*c₂ Second x_(out) 822 x₄ Second y_(out) 830 x₁*c₀ + x₂*c₁ + x₃*c₂ + x₄*c₃ + Element\Filter Tap Tap 812i Tap 812j Tap 812k Tap 812l Input to filter tap x₁₉ x₁₉, x₁₆ x₁₆, x₁₃ Output of Multiplexer x₁₉ x₁₆ x₁₃ 1^(st) delay element x₁₈ x₁₅ x₁₂ x₉ 2^(nd) delay element before x₁₄*c₀ x₁₀*c₀ + x₆*c₀ + adder x₁₁*c₁ x₇*c₁ + x₈*c₂ Third x_(out) 824 x₅ Third y_(out) 832 x₂*c₀ + x₃*c₁ + x₄*c₂ + x₅*c₃ + Element\Filter Tap Tap 812m Tap 812n Tap 812o Tap 812p Input to filter tap x₁₇, x₁₉ x₁₄, x₁₆, x₁₇ Output of Multiplexer x₁₇ x₁₄ 1^(st) delay element x₁₉ x₁₆ x₁₃ x₁₀ 2^(nd) delay element before x₁₅*c₀ x₁₁*c₀ + x₇*c₀ + adder x₁₂*c₁ x₈*c₁ + x₉*c₂ Fourth x_(out) 826 x₆ Fourth y_(out) 834 x₃*c₀ + x₄*c₁ + x₅*c₂ + x₆*c₃ +

Turning to FIG. 9, a system block diagram of an example of an implementation of a real (i.e., non-complex) FIR filter in the SFIR filter 900 is shown in accordance with the present disclosure. In this example, the SFIR filter 900 includes a pre-processing section 904, post-processing section 906, and FIR Matrix 908. The FIR Matrix 908 is in signal communication with both the pre-processing section 904 and post-processing section 906 via signal paths 910 and 912, respectively. The filter input x(n) 914 is input into the pre-processing section 904 and is passed directly to the FIR Matrix 908. The FIR Matrix 908 is configured as a standard real value FIR filter 916 having a transfer function of h₀(n). The FIR filter 916 receives the filter input x(n) 914 filters it and outputs an filter output y(n) 918 that is passed to the post-processing section 906. The post-processing section 906 then passes the filter output y(n) 918 without processing it. The post-processing section 906 is also in signal communication with pre-processing section 904 via a loopback signal path 920 that is utilized to pass data back to the pre-processing section 904.

In FIG. 10, a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter 900 is shown in accordance with the present disclosure. In this example, the FIR Matrix 908, for purposes of illustration, is shown to be a 4 by 4 filter matrix similar to the examples described earlier with regards to FIGS. 2, 4A, 4B, and 8. As such, the FIR Matrix 908 includes 16 filter taps 1000 a, 1000 b, 1000 c, 1000 d, 1000 e, 1000 f, 1000 g, 1000 h, 1000 i, 1000 j, 1000 k, 1000 l, 1000 m, 1000 n, 1000 o, and 1000 p having filter coefficients C₀ 1002 a, C₁ 1002 b, C₂ 1002 c, C₃ 1002 d, C₀ 1002 e, C₁ 1002 f, C₂ 1002 g, C₃ 1002 h, C₀ 1002 i, C₁ 1002 j, C₂ 1002 k, C₃ 10021, C₀ 1002 m, C₁ 1002 n, C₂ 1002 o, and C₃ 1002 p.

As described in relation to FIG. 9, the SFIR filter 900 receives the filter input x(n) 914 that is shown as parallel input values of x(0) 1004, x(1) 1006, x(2) 1008, and x(3) 1010 and produces the filter output y(n) 918 that is shown as parallel output values of y(0) 1012, y(1) 1014, y(2) 1016, and y(3) 1018, respectively.

It is appreciated that the column values of the filter coefficients are the same for the four paths since the SFIR filter 900 is configured as a real value parallel FIR filter having four parallel paths. As such, the filter coefficients C₀ 1002 a, C₀ 1002 e, C₀ 1002 i, and C₀ 1002 m are the same and equal to the value of filter coefficient C₀. Similarly, filter coefficients C₁ 1002 b, C₁ 1002 f, C₁ 1002 j, and C₁ 1002 n are the same and equal to the value of filter coefficient C₁, filter coefficients C₂ 1002 c, C₂ 1002 g, C₂ 1002 k, and C₂ 1002 o are the same and equal to the value of filter coefficient C₂, and filter coefficients C₃ 1002 d, C₃ 1002 h, C₃ 10021, and C₃ 1002 p are the same and equal to the value of filter coefficient C₃.

In FIG. 11, a system block diagram of an example of an implementation of a complex FIR filter in the SFIR filter 1100 is shown in accordance with the present disclosure. In this example, the SFIR filter 1100 includes a pre-processing section 1104, post-processing section 1106, and FIR Matrix 1108. The FIR Matrix 1108 is in signal communication with both the pre-processing section 1104 and post-processing section 1106 via signal paths 1110, 1112, 1114, 1116, 1118, 1120, 1122, and 1124, respectively.

The filter input x(n) 1126 is input into the pre-processing section 1104, where the filter input x(n) 1126 includes a filter input real component x_(re)(n) 1128 and a filter input imaginary component x_(im)(n) 1130 because in this example the filter input x(n) 1126 is a complex data signal. The filter input real component x_(re)(n) 1128 is passed to the FIR Matrix 1108 via signal paths 1110 and 1112 and the filter input imaginary component x_(im)(n) 1130 is passed to the FIR Matrix 1108 via signal paths 1114 and 1116. The FIR Matrix 1108 is configured as a complex value FIR filter having four FIR sub-filters 1132, 1134, 1136, and 1138 having transfer functions of h_(re)(n) and h_(im)(n), respectively.

In this example, the FIR sub-filter 1132 receives the filter input real component x_(re)(n) 1128, filters it, and outputs a first portion of a filter output that is passed to a first adder 1140 within the post-processing section 1106. Simultaneously, the FIR sub-filter 1136 receives the filter input imaginary component x_(im)(n) 1130, filters it, and outputs a second portion of the filter output that is passed to the first adder 1140. The second portion of a filter output may be complemented (i.e., converted into an opposite value) within the post-processing section 1106 so as to cause the first adder 1140 to subtract the second portion of the filter output from the first portion of the filter output to produce a filter output real component y_(re)(n) 1142.

Moreover, the FIR sub-filter 1134 receives the filter input real component x_(re)(n) 1128, filters it, and outputs an third portion of a filter output that is passed to a second adder 1144 within the post-processing section 1106. Simultaneously, the FIR sub-filter 1138 receives the filter input imaginary component x_(im)(n) 1130, filters it, and outputs an fourth portion of the filter output that is passed to the second adder 1144. The second adder 1144 adds the third portion of the filter output to the fourth portion of the filter output to produce a filter output imaginary component y_(im)(n) 1146. The filter output real component and filter output imaginary component may be combined in a single complex data signal referred to as filter output y(n) 1148.

In FIG. 12, a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter 1100 is shown in accordance with the present disclosure. In this example, the FIR Matrix 1108, for purposes of illustration, is shown to be an 8 by 8 filter matrix. As such, the FIR Matrix 1108 includes 64 filter taps 1200 a,a, 1200 a,b, 1200 a,c, 1200 a,d, 1200 a,e, 1200 a,f, 1200 a,g, 1200 a,h, 1200 b,a, 1200 b,b, 1200 b,c, 1200 b,d, 1200 b,e, 1200 b,f, 1200 b,g, 1200 b,h, 1200 c,a, 1200 c,b, 1200 c,c, 1200 c,d, 1200 c,e, 1200 c,f, 1200 c,g, 1200 c,h, 1200 d,a, 1200 d,b, 1200 d,c, 1200 d,d, 1200 d,e, 1200 d,f, 1200 d,g, 1200 d,h, 1200 e,a, 1200 e,b, 1200 e,c, 1200 e,d, 1200 e,e, 1200 e,f, 1200 e,g, 1200 e,h, 1200 f,a, 1200 f,b, 1200 f,c, 1200 f,d, 1200 f,e, 1200 f,f, 1200 f,g, 1200 f,h, 1200 g,a, 1200 g,b, 1200 g,c, 1200 g,d, 1200 g,e, 1200 g,f, 1200 g,g, 1200 g,h, 1200 h,a, 1200 h,b, 1200 h,c, 1200 h,d, 1200 h,e, 1200 h,f, 1200 gh,g, and 1200 h,h having filter coefficients C_(0re), C_(1re), C_(2re), C_(3re), C_(4re), C_(5re), C_(6re), C_(7re), C_(0im), C_(1im), C_(2im), C_(3im), C_(4im), C_(5im), C_(6im), and C_(7im), respectively.

In this example, the SFIR filter 1100 receives two complex input signal that are input into the pre-processing section 1104 as four real value input signals herein referred to as a first real input x_(re)(0) 1202 and a second real input x_(re)(1) 1204 and a first imaginary input x_(im)(0) 1206 and an imaginary phase input x_(im)(1) 1208. These signals are re-ordered and fanned out by the pre-processing section 1104 and feed into the FIR Matrix 1108, where the first real input x_(re)(0) 1202 is input into the filter taps 1200 a,a and 1200 c,a, the second real input x_(re)(1) 1204 is input into the filter taps 1200 b,a and 1200 d,a, the first imaginary input x_(im)(0) 1206 is input into the filter taps 1200 e,a and 1200 g,a, and the second imaginary input x_(im)(1) 1208 is input into the filter taps 1200 f,a and 1200 h,a.

The FIR Matrix 1108 then produces the intermediate outputs z_(ii)(0) 1210, z_(ii)(1) 1212, z_(iq)(0) 1214, z_(iq)(1) 1216, z_(qq)(0) 1218, z_(qq)(1) 1220, z_(qi)(0) 1222, and z_(qi)(1) 1224 that are passed to the post-processing section 1106. For simplicity of illustration, the subscript notation of the variables z have been changed to “i” for real instead of “re” and “q” for imaginary for “im,” since placing subscripts “im” and “re” or “re” and “im” would be confusing. As such, the subscripts for the variable z will be “z_(ii)” instead of “z_(rere),” “z_(iq)” instead of “z_(reim),” “z_(qi)” instead of “z_(imre),” and “z_(qq)” instead of “z_(imim).”

As such, the post-processing section 1106 then combines the intermediate outputs z_(ii)(0) 1210 with z_(qq)(0) 1218 at a first adder 1226 to produce a first complex filter output signal y_(re)(0) 1228 and z_(ii)(1) 1212 with z_(qq)(1) 1220 at a second adder 1230 to produce a second complex filter output signal y_(im)(0) 1232. In this example, the intermediate outputs z_(qq)(0) 1218 and z_(qq)(1) 1220 may be complimented to produce opposite values such that the first adder 1226 and second adder 1230 produce subtractions between z_(ii)(0) 1210 with z_(qq)(0) 1218 and y_(re)(0) 1228 and z_(ii)(1) 1212, respectively. Furthermore, the post-processing section 1106 then also combines the intermediate outputs z_(iq)(0) 1214 with z_(qi)(0) 1222 at a third adder 1234 to produce a third complex filter output signal y_(re)(1) 1236 and combines the intermediate z_(iq)(1) 1216 with z_(qi)(1) 1224 at a fourth adder 1238 to produce a fourth complex filter output signal y_(q)(1) 1240.

In FIG. 13, a system block diagram of an example of an implementation of a decimator in the SFIR filter 1300 is shown in accordance with the present disclosure. As before, in this example, the SFIR filter 1300 includes a pre-processing section 1302, post-processing section 1304, and FIR Matrix 1306. The FIR Matrix 1306 is in signal communication with both the pre-processing section 1302 and post-processing section 1304 via signal paths 1308, 1310, 1312, 1314, 1316, and 1318, respectively.

In this example, the pre-processing section 1302 receives the filter input x(n) 1320. The pre-processing section 1302 is configured, in this example, as a distribution network 1322 that re-orders the filter input x(n) 1320 and feeds the FIR sub-filters 1324, 1326, and 1328, respectively. The FIR sub-filters 1324, 1326, and 1328 have the corresponding transfer functions H₀(n), H₁(n), and H_(D-1)(n), where D represents the number of FIR sub-filters present in the FIR Matrix 1306.

In this example, the first FIR sub-filter 1324 is in signal communication with the distribution network 1322 via signal path 1308, the second FIR sub-filter 1326 is in signal communication with the distribution network 1322 via signal path 1310, and the third FIR sub-filter 1328 is in signal communication with the distribution network 1322 via signal path 1312. The post-processing section 1304 is configured as a summation network 1330 that adds the outputs of the FIR sub-filters 1324, 1326, and 1328. The first FIR sub-filter 1324 is in signal communication with the summation network 1330 via signal path 1314, the second FIR sub-filter 1326 is in signal communication with the summation network 1330 via signal path 1316, and the third FIR sub-filter 1328 is in signal communication with the summation network 1330 via signal path 1318.

In an example of operation, the first FIR sub-filter 1324 receives a filter input from the distribution network 1322, filters it, and outputs a first portion of a filter output that is passed to the summation network 1330. Simultaneously: the second FIR sub-filter 1326 receives a filter input from the distribution network 1322, filters it, and outputs a first portion of a filter output that is passed to the summation network 1330; and the third FIR sub-filter 1328 receives a filter input from the distribution network 1322, filters it, and outputs a first portion of a filter output that is passed to the summation network 1330. The outputs from the FIR sub-filters 1324, 1326, and 1328 are received by the summation network 1330 and combined (i.e., added together) to produce a filter output y(n/D) 1332, where the filter input x(n) 1320 has n number of inputs and the filter output y(n/D) 1332 has n/D outputs. As such, in this example, the n number of inputs in the filter input x(n) 1320 are decimated into n/D outputs of the filter output y(n/D) 1332.

In FIG. 14, a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter 1300 is shown in accordance with the present disclosure. In this example, the FIR Matrix 1306, for purposes of illustration, is shown to be an 8 by 8 filter matrix. In this example, there are eight (8) real inputs, four (4) real outputs, 64 filter taps with 16 tap coefficients, and D equals 2. As such, the FIR Matrix 1306 includes 64 filter taps 1400 a,a, 1400 a,b, 1400 a,c, 1400 a,d, 1400 a,e, 1400 a,f, 1400 a,g, 1400 a,h, 1400 b,a, 1400 b,b, 1400 b,c, 1400 b,d, 1400 b,e, 1400 b,f, 1400 b,g, 1400 b,h, 1400 c,a, 1400 c,b, 1400 c,c, 1400 c,d, 1400 c,e, 1400 c,f, 1400 c,g, 1400 c,h, 1400 d,a, 1400 d,b, 1400 d,c, 1400 d,d, 1400 d,e, 1400 d,f, 1400 d,g, 1400 d,h, 1400 e,a, 1400 e,b, 1400 e,c, 1400 e,d, 1400 e,e, 1400 e,f, 1400 e,g, 1400 e,h, 1400 f,a, 1400 f,b, 1400 f,c, 1400 f,d, 1400 f,e, 1400 f,f, 1400 f,g, 1400 f,h, 1400 g,a, 1400 g,b, 1400 g,c, 1400 g,d, 1400 g,e, 1400 g,f, 1400 g,g, 1400 g,h, 1400 h,a, 1400 h,b, 1400 h,c, 1400 h,d, 1400 h,e, 1400 h,f, 1400 gh,g, and 1400 h,h having filter coefficients C₀, C₁, C₂, C₃, C₄, C₅, C₆, C₇, C₈, C₉, C₁₀, C₁₁, C₁₂, C₁₃, C₁₄, and C₁₅, respectively.

In this example, the SFIR filter 1300 receives the filter input x(n) 1320 that is input into the pre-processing section 1302 as eight input signals herein referred to as first input signal x(0) 1402, second input signal x(1) 1404, third input signal x(2) 1406, fourth input signal x(3) 1408, fifth input signal x(4) 1410, sixth input signal x(5) 1412, seventh input signal x(6) 1414, and eighth input signal x(7) 1415.

These signals are re-ordered by the pre-processing section 1302 and input into the FIR Matrix 1306, where the first input signal x(0) 1402 is input into the filter tap 1400 a,a, the second input signal x(1) 1404 is input into the filter taps 1400 e,a, the third input signal x(2) 1406 is input into the filter tap 1400 b,a, the fourth input signal x(3) 1408 is input into the filter tap 1400 f,a, the fifth input signal x(4) 1410 is input into the filter tap 1400 c,a, the sixth input signal x(5) 1412 is input into the filter tap 1400 g,a, the seventh input signal x(6) 1414 is input into the filter tap 1400 d,a, and the eighth input signal x(7) 1415 is input into the filter tap 1400 h,a.

The FIR Matrix 1306 then produces the intermediate outputs z(0) 1416, z(1) 1418, z(2) 1420, z(3) 1422, z(4) 1424, z(5) 1426, z(6) 1428, and z(7) 1430 that are passed to the post-processing section 1106.

As such, the post-processing section 1304 then combines the intermediate outputs z(0) 1416 with z(4) 1424 at a first adder 1432 to produce a first output signal y(0) 1434 and z(1) 1418 with z(5) 1426 at a second adder 1436 to produce an output signal y(1) 1438. Moreover, the intermediate outputs z(2) 1420 and z(6) 1428 at a third adder 1440 to produce a third output signal y(2) 1442 and the intermediate outputs z(3) 1422 and z(7) 1430 at a fourth adder 1444 to produce a fourth output signal y(3) 1446.

In FIG. 15, a system block diagram of an example of an implementation of a decimator in the SFIR filter 1500 for a decimator is shown in accordance with the present disclosure. As before, in this example, the SFIR filter 1500 includes a pre-processing section 1502, post-processing section 1504, and FIR Matrix 1506. The FIR Matrix 1506 is in signal communication with both the pre-processing section 1502 and post-processing section 1504 via signal paths 1508, 1510, 1512, 1514, 1516, and 1518, respectively.

In this example, the pre-processing section 1502 receives the filter input x(n) 1520. The pre-processing section 1502 is configured to fan out the filter input x(n) 1520 and feed the FIR sub-filters 1522, 1524, and 1526, respectively. The FIR sub-filters 1522, 1524, and 1526 have the corresponding transfer functions H₀(n), H₁(n), and H_(I-1)(n), where I represents the number of FIR sub-filters present in the FIR Matrix 1306. The post-processing section 1504 is configured to operate as a distribution network 1528.

In this example, the first FIR sub-filter 1522 is in signal communication with the distribution network 1528 via signal path 1514, the second FIR sub-filter 1524 is in signal communication with the distribution network 1528 via signal path 1516, and the third FIR sub-filter 1526 is in signal communication with the distribution network 1528 via signal path 1518. The distribution network 1528 distributes and re-orders the intermediate filter outputs of the FIR sub-filters 1522, 1524, and 1526 to produce the filter outputs y₀(n) 1530, y₁(n) 1532, and y_(I-1)(n) 1534.

In an example of operation, the first FIR sub-filter 1522 receives a filter input from pre-processing section 1502, filters it, and outputs an intermediate filter output that is passed to the distribution network 1528. Simultaneously: the second FIR sub-filter 1524 receives a filter input from the from pre-processing section 1502, filters it, and outputs another intermediate filter output that is passed to the distribution network 1528; and the third FIR sub-filter 1526 receives a filter input from the from pre-processing section 1502, filters it, and outputs another intermediate filter output that is passed to the distribution network 1528.

The intermediate filter outputs from the FIR sub-filters 1522, 1524, and 1526 are received by the distribution network 1528 and distributed and re-order to produce the filter outputs y₀(n) 1530, y₁(n) 1532, and y_(I-1)(n) 1534. In this example, then number of inputs in the filter input x(n) 1520 are interpolated into n times I number of filter outputs y₀(n) 1530, y₁(n) 1532, and y_(I-1)(n) 1534, where the number I represents the number of FIR sub-filters present in the FIR Matrix 1306.

In FIG. 16, a system block diagram of an example of an implementation of the coefficient values utilized by the SFIR filter 1500 for an interpolator is shown in accordance with the present disclosure. In this example, the FIR Matrix 1506, for purposes of illustration, is shown to be an 8 by 8 filter matrix. In this example, there are eight (8) real inputs, four (4) real outputs, 64 filter taps with 16 tap coefficients, and D equals 2. As such, the FIR Matrix 1506 includes 64 filter taps 1600 a,a, 1600 a,b, 1600 a,c, 1600 a,d, 1600 a,e, 1600 a,f, 1600 a,g, 1600 a,h, 1600 b,a, 1600 b,b, 1600 b,c, 1600 b,d, 1600 b,e, 1600 b,f, 1600 b,g, 1600 b,h, 1600 c,a, 1600 c,b, 1600 c,c, 1600 c,d, 1600 c,e, 1600 c,f, 1600 c,g, 1600 c,h, 1600 d,a, 1600 d,b, 1600 d,c, 1600 d,d, 1600 d,e, 1600 d,f, 1600 d,g, 1600 d,h, 1600 e,a, 1600 e,b, 1600 e,c, 1600 e,d, 1600 e,e, 1600 e,f, 1600 e,g, 1600 e,h, 1600 f,a, 1600 f,b, 1600 f,c, 1600 f,d, 1600 f,e, 1600 f,f, 1600 f,g, 1600 f,h, 1600 g,a, 1600 g,b, 1600 g,c, 1600 g,d, 1600 g,e, 1600 g,f, 1600 g,g, 1600 g,h, 1600 h,a, 1600 h,b, 1600 h,c, 1600 h,d, 1600 h,e, 1600 h,f, 1600 gh,g, and 1600 h,h having filter coefficients C₀, C₁, C₂, C₃, C₄, C₅, C₆, C₇, C₈, C₉, C₁₀, C₁₁, C₁₂, C₁₃, C₁₄, and C₁₅, respectively.

In this example, the SFIR filter 1500 receives the filter input x(n) 1520 that is input into the pre-processing section 1502 as four (4) input signals herein referred to as first input signal x(0) 1602, second input signal x(1) 1604, third input signal x(2) 1606, and fourth input signal x(3) 1608. These signals are fanned out by the pre-processing section 1502 and input into the FIR Matrix 1506, where the first input signal x(0) 1602 is input into the filter taps 1600 a,a and 1600 e,a, the second input signal x(1) 1604 is input into the filter taps 1600 b,a and 1600 f,a, the third input signal x(2) 1606 is input into the filter tap 1600 c,a and 1600 g,a, the fourth input signal x(3) 1608 is input into the filter tap 1600 d,a and 1600 h,a. The FIR Matrix 1506 then produces the intermediate outputs z(0) 1610, z(1) 1612, z(2) 1614, z(3) 1616, z(4) 1618, z(5) 1620, z(6) 1622, and z(7) 1624 that are passed to the post-processing section 1504.

As such, the post-processing section 1504 then re-orders, with the distribution network 1528, the intermediate outputs z(0) 1610, z(1) 1612, z(2) 1614, z(3) 1616, z(4) 1618, z(5) 1620, z(6) 1622, and z(7) 1624 to produce the filter output signals y(0) 1626, y(1) 1628, y(2) 1630, y(3) 1632, y(4) 1634, y(5) 1636, y(6) 1638, and y(7) 1640.

In this example, the SFIR filter 1500 receives four (4) real input signals x(0) 1602, x(1) 1604, x(2) 1606, and x(3) and produces eight (8) real output signals y(0) 1626, y(1) 1628, y(2) 1630, y(3) 1632, y(4) 1634, y(5) 1636, y(6) 1638, and y(7) 1640 based on I equal to 2 and 16 real coefficients.

It will be understood that various aspects or details of the disclosure may be changed without departing from the scope of the disclosure. It is not exhaustive and does not limit the claimed disclosures to the precise form disclosed. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation. Modifications and variations are possible in light of the above description or may be acquired from practicing the disclosure. The claims and their equivalents define the scope of the disclosure.

In some alternative examples of implementations, the function or functions noted in the blocks may occur out of the order noted in the figures. For example, in some cases, two blocks shown in succession may be executed substantially concurrently, or the blocks may sometimes be performed in the reverse order, depending upon the functionality involved. Also, other blocks may be added in addition to the illustrated blocks in a flowchart or block diagram.

The description of the different examples of implementations has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the examples in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. Further, different examples of implementations may provide different features as compared to other desirable examples. The example, or examples, selected are chosen and described in order to best explain the principles of the examples, the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various examples with various modifications as are suited to the particular use contemplated. 

What is claimed is:
 1. A Scalable Finite Impulse Response (“SFIR”) filter comprising a pre-processing section; a post-processing section; and a finite impulse response (“FIR”) Matrix, wherein the FIR Matrix includes a plurality of filter taps and a plurality of signal paths in signal communication with each filter tap of the plurality of filter taps, wherein the plurality of signal paths are arranged to allow re-configurable data throughput between each filter tap, wherein the pre-processing section and the post-processing section are in signal communication with the FIR Matrix.
 2. The SFIR filter of claim 1, wherein the FIR Matrix includes four filter taps arranged as a two by two matrix of filter taps.
 3. The SFIR filter of claim 2, wherein each filter tap includes a multiplexer, a first flip-flop in signal communication with an output of the multiplier, a gain section, a second flip-flop, and an adder in signal communication with both the multiplier and the second flip-flop.
 4. The SFIR filter of claim 3, wherein the gain section includes a gain section multiplier and a coefficient section.
 5. The SFIR filter of claim 4, wherein each flip-flop, of each filter tap, is a D flip-flop.
 6. The SFIR filter of claim 3, wherein the plurality of signal paths includes a first serial signal path from a first filter tap to a second filter tap, a second serial signal path from the second filter tap to a third filter tap, a first cross signal path from the first filter tap to a fourth filter tap, a second cross signal path from the third filter tap to the second filter tap, and a third serial signal path from the third filter tap to the fourth filter tap.
 7. The SFIR filter of claim 6, wherein the first serial signal path is a signal path from an output of a first filter tap multiplexer to an input of a second filter tap multiplexer, the second serial signal path is a signal path from an output of the second filter tap multiplexer to an input of a third filter tap multiplexer, the first cross signal path is a signal path from the output of the first filter tap multiplexer to an input of a fourth filter tap multiplexer, the second cross signal path from an output of the third filter tap multiplexer to the input of the second filter tap multiplexer, and the third serial signal path from the output of the third filter tap multiplexer to the input of the fourth filter tap multiplexer.
 8. The SFIR filter of claim 7, wherein the plurality of signal paths further includes a first adder signal path from a first filter tap adder to a second filter tap second flip-flop, and a second adder signal path from a third filter tap adder to a fourth filter tap second flip-flop.
 9. The SFIR filter of claim 8, wherein the plurality of signal paths further includes a first pipeline data signal path from a first filter first flip-flop to the second filter tap second flip-flop through a first filter gain section multiplier and a first filter adder, and a second pipeline data signal path from a third filter first flip-flop to the fourth filter tap second flip-flop through a third filter gain section multiplier and a third filter adder.
 10. The SFIR filter of claim 9, wherein the plurality of signal paths are arranged to configure the SFIR filter into a one serial input four tap filter or a two parallel input two tap filter.
 11. The SFIR filter of claim 1, wherein the SFIR filter is a type of filter chosen from the group consisting of a Hilbert transform filter, decimator, interpolator, real FIR filter, complex FIR filter, and adaptive filter.
 12. The SFIR filter of claim 11, wherein the real FIR filter includes the pre-processing section configured as a first pass-through device and the post-processing section configured as a second pass-through device.
 13. The SFIR filter of claim 11, wherein the complex FIR filter includes the pre-processing section configured as a fan-out device and the post-processing section configured as a summation device.
 14. The SFIR filter of claim 11, wherein the decimator includes the pre-processing section configured as a re-order device and the post-processing section configured as a summation device.
 15. The SFIR filter of claim 11, wherein the interpolator includes the pre-processing section configured as a fan-out device and the post-processing section configured as a re-order device.
 16. A Scalable Finite Impulse Response (“SFIR”) filter comprising means for pre-processing; means for post-processing; a finite impulse response (“FIR”) filtering matrix, wherein the FIR Matrix includes a plurality of filter taps, and a plurality of signal paths in signal communication with each filter tap of the plurality of filter taps, wherein the plurality of signal paths includes means to allow re-configurable data throughput between each filter tap; and wherein the means for pre-processing and the means for post-processing are in signal communication with the FIR Matrix.
 17. An Application Specific Integrated Circuit (“ASIC”) comprising: a Scalable Finite Impulse Response (“SFIR”) filter including a pre-processing section, a post-processing section, a finite impulse response (“FIR”) Matrix, wherein the FIR Matrix includes a plurality of filter taps and a plurality of signal paths in signal communication with each filter tap of the plurality of filter taps, wherein the plurality of signal paths are arranged to allow re-configurable data throughput between each filter tap, wherein the pre-processing section and the post-processing section are in signal communication with the FIR Matrix and wherein a number of filter taps of the plurality of filter taps is predetermined.
 18. The ASIC of claim 17, wherein each filter tap includes a multiplexer, a first flip-flop in signal communication with an output of the multiplier, a gain section having a gain section multiplier and a coefficient section, a second flip-flop, and an adder in signal communication with both the multiplier and the second flip-flop.
 19. The ASIC of claim 18, wherein the FIR Matrix includes four filter taps arranged as a two by two matrix of filter taps, wherein the plurality of signal paths includes a first serial signal path from a first filter tap to a second filter tap, a second serial signal path from the second filter tap to a third filter tap, a first cross signal path from the first filter tap to a fourth filter tap, a second cross signal path from the third filter tap to the second filter tap, and a third serial signal path from the third filter tap to the fourth filter tap, and wherein the first serial signal path is a signal path from an output of a first filter tap multiplexer to an input of a second filter tap multiplexer, the second serial signal path is a signal path from an output of the second filter tap multiplexer to an input of a third filter tap multiplexer, the first cross signal path is a signal path from the output of the first filter tap multiplexer to an input of a fourth filter tap multiplexer, the second cross signal path from an output of the third filter tap multiplexer to the input of the second filter tap multiplexer, and the third serial signal path from the output of the third filter tap multiplexer to the input of the fourth filter tap multiplexer.
 20. The ASIC of claim 19, wherein the plurality of signal paths further includes a first adder signal path from a first filter tap adder to a second filter tap second flip-flop, and a second adder signal path from a third filter tap adder to a fourth filter tap second flip-flop, wherein the plurality of signal paths further includes a first pipeline data signal path from a first filter first flip-flop to the second filter tap second flip-flop through a first filter gain section multiplier and a first filter adder, and a second pipeline data signal path from a third filter first flip-flop to the fourth filter tap second flip-flop through a third filter gain section multiplier and a third filter adder. 